Proceedings of the 17 th Meeting of Computational Linguistics in the Netherlands ( CLIN 17 )

نویسندگان

  • Peter Dirix
  • Ineke Schuurman
  • Vincent Vandeghinste
  • Frank Van Eynde
  • Stephan Oepen
  • Thomas Zastrow
  • Marco René Spruit
  • Katja Hofmann
  • Laurens van der Werff
  • Willemijn Heeren
  • Roeland Ordelman
  • Franciska de Jong
چکیده

I will review recent advances in grammar-based sentence realization from logical-form meaning representations. The LOGON MT prototype aims at the fully-automated, highquality translation of Norwegian instructional texts (on backcountry activities) into English. The LOGON generator operates off underspecified meaning representations derived from ‘deep’ grammatical analysis (in the LFG framework) and subsequent semantic transfer. The generator builds on the LinGO English Resource Grammar (in the HPSG framework) and combines a highly optimized chart-based algorithm with a rich, probabilistic model to rank alternate realizations. Integration of the stochastic model into the enumeration of outputs from the packed chart allows the generator to selectively unpack n-best lists of realizations with minimal search. Besides empirical results for the realization task when evaluated in isolation, I will present a summary of quantitative measures on the current development status (and promise) of the LOGON MT pipeline as a whole. Proceedings of the 17th Meeting of Computational Linguistics in the Netherlands Edited by: Peter Dirix, Ineke Schuurman, Vincent Vandeghinste, and Frank Van Eynde. Copyright c 2007 by the individual authors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Linguistics in the Netherlands 2005, Proceedings 16th Meeting of Computational Linguistics in the Netherlands, December 16, 2005, University of Amsterdam

Building on the successes of the past decade’s work on statistical methods, there are signs that continued quality improvement for QA, summarization, information extraction, and possibly even machine translation require more-elaborate and possibly even (shallow) semantic representations of text meaning. But how can one define a large-scale shallow semantic representation system and contents ade...

متن کامل

Proceedings of the COLING - ACL ' 98 Joint Conference ( The 17 th InternationalConference on Computational Linguistics

The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the \glue language" approach to LFG semantics, and in the formulation and parsing of various categorial grammars. These applications call for eecient deduction methods. Although a number of deduction methods for multiplicative linear logic are known, none of them are tabular methods ,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007